An Iterated Greedy Algorithm for a Parallel Machine Scheduling Problem with Re-entrant and Group Processing Features

This research paper addresses a novel parallel machine scheduling problem with re-entrant and group processing features, specifically motivated by the hot milling process in the modern steel manufacturing industry. The objective is to minimize the makespan. As no existing literature exists on this problem, the paper begins by analyzing the key characteristics of the problem. Subsequently, a mixed integer linear programming model is formulated. To tackle the problem, an improved iterated greedy algorithm (IGA) is proposed. The IGA incorporates a problem-specific heuristic to construct the initial solution. Additionally, it incorporates an effective destruction and reconstruction procedure. Furthermore, an acceptance rule is developed to prevent the IGA from getting stuck in local optima. The proposed approach is evaluated through computational experiments. The results demonstrate that the proposed IGA outperforms three state-of-the-art meta-heuristics, highlighting its high effectiveness. Overall, this research contributes to the understanding and solution of the parallel machine scheduling problem with re-entrant and group processing features in the context of the hot milling process. The proposed algorithm provides insights for practical applications in the steel manufacturing industry

Regulating the performance of polybenzoxazine via the regiochemistry of amide substituents

Regulating the performance of polybenzoxazine via the regiochemistry of amide substituent